Design of Nearest Prototype Classifier by using Differential Evolutionary Algorithm

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Evolutionary Design of Nearest Prototype Classifiers

In pattern classification problems, many works have been carried out with the aim of designing good classifiers from different perspectives. These works achieve very good results in many domains. However, in general they are very dependent on some crucial parameters involved in the design. These parameters have to be found by a trial and error process or by some automatic methods, like heuristi...

متن کامل

Optimized distance metrics for differential evolution based nearest prototype classifier

In this article, we introduce a differential evolution based classifier with extension for selecting automatically the applied distance measure from a predefined pool of alternative distances measures to suit optimally for classifying the particular data set at hand. The proposed method extends the earlier differential evolution based nearest prototype classifier by extending the optimization p...

متن کامل

OPTIMAL CONSTRAINED DESIGN OF STEEL STRUCTURES BY DIFFERENTIAL EVOLUTIONARY ALGORITHMS

Structural optimization, when approached by conventional (gradient based) minimization algorithms presents several difficulties, mainly related to computational aspects for the huge number of nonlinear analyses required, that regard both Objective Functions (OFs) and Constraints. Moreover, from the early '80s to today's, Evolutionary Algorithms have been successfully developed and applied as a ...

متن کامل

Nearest prototype classifier designs: An experimental study

We compare eleven methods for finding prototypes upon which to base the nearest Ž prototype classifier. Four methods for prototype selection are discussed: Wilson Hart a . condensation error-editing method , and three types of combinatorial search random search, genetic algorithm, and tabu search. Seven methods for prototype extraction are discussed: unsupervised vector quantization, supervised...

متن کامل

Nearest-prototype Classifier Design by Deterministic Annealing with Random Class Labels∗

The design of nearest-prototype (NP) classifiers is a challenging problem because of the prevalence of poor local minima, and the piecewise constant nature of the cost function which is incompatible with gradientbased techniques. This paper extends the deterministic annealing (DA) method for NP-classifier design in two ways. First, the association between prototypes and class labels is also ran...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Korean Institute of Intelligent Systems

سال: 2011

ISSN: 1976-9172

DOI: 10.5391/jkiis.2011.21.4.487